Interally Typed Second-Order Term Graphs
نویسنده
چکیده
Wepresent a typing concept for second-order term graphsthat doesnot consider the types as an external add-on, but as an integral part of the term graph structure. This allows a homogeneous treatment of term-graph representationsof many kinds of typing systems, including second-order λ-calculi and systems of dependent types. Applications can be found in interactive systems and as typed intermediate representation for example in compilers.
منابع مشابه
Internally Typed Second-Order Term Graphs
Wepresent a typing concept for second-order term graphsthat doesnot consider the types as an external add-on, but as an integral part of the term graph structure. This allows a homogeneous treatment of term-graph representationsof many kinds of typing systems, including second-order λ-calculi and systems of dependent types. Applications can be found in interactive systems and as typed intermedi...
متن کاملArgument Filterings and Usable Rules for Simply Typed Dependency Pairs
Simply typed term rewriting [Yam01] is a framework of higher-order term rewriting without bound variables. The authors extended the first-order dependency pair approach [AG00] to the case of simply typed term rewriting [AY05]. They gave a characterization of minimal non-terminating simply typed terms and incorporated the notions of dependency pairs, dependency graphs, and estimated dependency g...
متن کاملDependently-Typed Formalisation of Typed Term Graphs
The Coconut project [AK09a, AK09b] uses “code graphs” [KAC06], a variant of term graphs in the spirit of “jungles” [HP91, CR93], as intermediate presentation for the generation of highly optimised assembly code. This is currently implemented in Haskell, and we use the Haskell type system in an embedded domain-specific language (EDSL) for creating such code graphs via what appears to be standard...
متن کاملOn the second order first zagreb index
Inspired by the chemical applications of higher-order connectivity index (or Randic index), we consider here the higher-order first Zagreb index of a molecular graph. In this paper, we study the linear regression analysis of the second order first Zagreb index with the entropy and acentric factor of an octane isomers. The linear model, based on the second order first Zag...
متن کاملHigher-Order Value Flow Graphs
The concepts of value-and control-ow graphs are important for program analysis of imperative programs. An imperative value ow graph can be constructed by a single pass over the program text. No similar concepts exist for higher-order languages: we propose a method for constructing value ow graphs for typed higher-order functional languages. A higher-order value ow graph is constructed by a sing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998